Shortest curves in planar regions with curved boundary
نویسندگان
چکیده
منابع مشابه
Minimal Surfaces with Planar Boundary Curves
In 1956, Shiffman [Sh] proved that any compact minimal annulus with two convex boundary curves (resp. circles) in parallel planes is foliated by convex planar curves (resp. circles) in the intermediate planes. In 1978, Meeks conjectured that the assumption the minimal surface is an annulus is unnecessary [M]; that is, he conjectured that any compact connected minimal surface with two planar con...
متن کاملShortest path in a simply-connected domain having curved boundary
Given two distinct points S and E on a simply-connected domain (without holes) enclosed by a closed parametric curve, this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. SIP consists of portions of curves along with straight line segments that are tangential to the curve. The algorithm initially computes point-curve tangents and bitang...
متن کاملCurved planar quantum wires with Dirichlet and Neumann boundary conditions
The spectral properties of curved quantum wires with Dirichlet boundary condition were widely investigated (e.g. [1], [2], [3]). It was shown that any small curvature of the tube in dimensions 2 and 3 produces at least one positive eigenvalue below the essential spectrum threshold. The problem of the existence of such eigenvalues in the straight quantum waveguides with a combination of Dirichle...
متن کاملShortest Paths Help Solve Geometric Optimization Problems in Planar Regions
The goal of this paper is to show that the concept of the shortest path inside a polygonal region contributes to the design of eecient algorithms for certain geometric optimization problems involving simple polygons: computing optimum separators, maximum area or perimeter inscribed triangles, a minimum area circumscribed concave quadrilateral, or a maximum area contained triangle. The structure...
متن کاملDecontaminating Planar Regions by Sweeping with Barrier Curves
If seven maids with seven mops Swept it for half a year. Do you suppose,” the Walrus said, “That they could get it clear?” “I doubt it,” said the Carpenter, And shed a bitter tear. We consider the problem of decontaminating (cleaning) the interior of a planar shape by sweeping it with barrier curves. The contaminant is assumed to instantly travel any path not blocked by a barrier. We show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90019-p